On the Minimization Problem for Sequential Programs
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولImplementing Sequential and Parallel Programs for the Homing Sequence Problem
Homing sequences play an important role in the testing of nite state systems and have been used in a number of applications such as hardware fault-detection 7], protocol veriication 4], and learning algorithms 11, 3, 1] etc. Here we present a parallel program implementation that nds a homing sequence for an input DFA. Our program can handle randomly generated instances with millions of states, ...
متن کاملMinimization algorithms for sequential transducers
We present general algorithms for minimizing sequential nite-state transducers that output strings or numbers. The algorithms are shown to be e cient since in the case of acyclic transducers and for output strings they operate in O(S + |E|+ |V |+ (|E| − |V |+ |F |) · (|Pmax|+ 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions ...
متن کاملOn crossing minimization problem
In this paper we consider a problem related to global routing post-optimization: the crossing minimization problem (CMP). Given a global routing representation, the CMP is to minimize redundant crossings between every pair of nets. In particular, there are two kinds of CMP: constrained CMP (CCMP) and unconstrained CMP (UCMP). These problems have been studied previously in Groe89], where an O(m ...
متن کاملMinimization of Sequential Transducers
We present an algorithm for minimizing sequential transducers. This algorithm is shown to be eecient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej ? jV j + jFj):(jPmaxj + 1) steps, where E is the set of edges of the given transducer, V the set of its vertices, F the set of nal states, and Pmax the longest of the greatest common preexes of the output paths leaving e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2017
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2017-4-415-433